Junípero Serra’s Canonization or Eurocentric Heteronomy
نویسندگان
چکیده
منابع مشابه
Finite canonization
The canonization theorem says that for given m, n for some m (the first one is called ER(n;m)) we have for every function f with domain [1, . . . , m], for some A ∈ [1, . . . , m], the question of when the equality f(i1, . . . , in) = f(j1, . . . , jn) (where i1 < · · · < in and j1 < · · · jn are from A) holds has the simplest answer: for some v ⊆ {1, . . . , n} the equality holds iff ∧
متن کاملControlling Between Autonomy and Heteronomy
The strategic playing field of controllers from the perspective of the services to be delivered and the relationships to internal customer, were frequent references to how controllers should adapt their abilities to such challenges. Controllers should therefore under no circumstances take comfort in their very strong internal competitive position, but have to work actively on its ongoing strate...
متن کاملUntyped XQuery Canonization
XQuery is a powerful language defined by the W3C to query XML documents. Its query functionalities and its expressiveness satisfy the major needs of both the database community and the text and documents community. As an inconvenient, the grammar used to define XQuery is thus very complex and leads to several equivalent query expressions for one same query. This complexity often discourages XQu...
متن کاملCompressed Tree Canonization
Straight-line (linear) context-free tree (SLT) grammars have been used to compactly represent ordered trees. Equivalence of SLT grammars is decidable in polynomial time. Here we extend this result and show that isomorphism of unordered trees given as SLT grammars is decidable in polynomial time. The result generalizes to isomorphism of unrooted trees and bisimulation equivalence. For non-linear...
متن کاملTree Canonization and Transitive Closure
We prove that tree isomorphism is not expressible in the language FO TC COUNT This is surprising since in the presence of ordering the language captures NL whereas tree isomorphism and canonization are in L Lin Our proof uses an Ehrenfeucht Fra ss e game for transitive closure logic with counting Gr a IL As a corresponding upper bound we show that tree canonization is expressible in FO COUNT lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Anglica Posnaniensia
سال: 2018
ISSN: 2082-5102,0081-6272
DOI: 10.2478/stap-2018-0013